منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملHybrid Task Allocation Tool for Distributed Systems
This paper describes the hybrid approach to task allocation in distributed systems by using problem-solving methods of the artificial intelligence. For the static mapping the objective function is used to evaluate the optimality of the allocation of a task graph onto a processor graph. Together with our optimization method also augmented simulated annealing and heuristic move exchange methods i...
متن کاملDynamic Task Allocation Models for Large Distributed Computing Systems
Dynamic task allocation for distributed computing systems (DCS) is an important goal to be achieved for engineering applications. The object is to maintain maximum utilization of computing resources while ensuring job performance at the highest productive level. The process of dynamic task allocation is to allocate or reallocate jobs (or tasks) to processors in a dynamic environment so that eve...
متن کاملDistributed, low contention task allocation
Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of memory contention, so that performance does not su er because of limitations on processor-to-memory bandwidth. In this work, we present a comparative study of throughput and contentio...
متن کاملReliable Task Allocation in Distributed System
This paper presents a rigorous framework of efficient task allocation in heterogeneous distributed environment where server nodes can fail permanently. The system performance can be improved by increasing the probability of serving queued tasks in the distributed computing system (DCS) before all the node fails. For a large set of tasks that is being allocated into a distributed environment, se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i31/89615